Visualizing Graphs as Maps with Contiguous Regions
نویسندگان
چکیده
Relational datasets, which include clustering information, can be visualized with tools such as BubbleSets, LineSets, SOM, and GMap. The countries in SOM-based and GMap-based visualizations are fragmented, i.e., they are represented by several disconnected regions. While BubbleSets and LineSets have contiguous regions, these regions may overlap, even when the input clustering is non-overlapping. We describe two methods for creating non-fragmented and non-overlapping maps within the GMap framework. The first approach achieves contiguity by preserving the given embedding and creating a clustering based on geometric proximity. The second approach achieves contiguity by preserving the clustering information. The methods are quantitatively evaluated using embedding and clustering metrics, and their usefulness is demonstrated with several real-world datasets and a fullyfunctional online system at gmap.cs.arizona.edu.
منابع مشابه
A Saliency Detection Model via Fusing Extracted Low-level and High-level Features from an Image
Saliency regions attract more human’s attention than other regions in an image. Low- level and high-level features are utilized in saliency region detection. Low-level features contain primitive information such as color or texture while high-level features usually consider visual systems. Recently, some salient region detection methods have been proposed based on only low-level features or hig...
متن کاملMolMap - Visualizing Molecule Libraries as Topographic Maps
We present a new application for graph drawing and visualization in the context of drug discovery. Combining the scaffold-based cluster hierarchy with molecular similarity graphs — both standard concepts in cheminformatics — allows one to get new insights for analyzing large molecule libraries. The derived clustered graphs represent different aspects of structural similarity. We suggest visuali...
متن کاملSpectral Graph Theory Lecture 25 Planar Graphs , part 1 Daniel
Planar graphs originated with the studies of polytopes and of maps. The skeleton (edges) of a threedimensional polytope provide a planar graph. We obtain a planar graph from a map by representing countries by vertices, and placing edges between countries that touch each other. Assuming each country is contiguous, this gives a planar graph. While planar graphs were introduced for practical reaso...
متن کاملMapSets: Visualizing Embedded and Clustered Graphs
In addition to objects and relationships between them, groups or clusters of objects are an essential part of many real-world datasets: party affiliation in political networks, types of living organisms in the tree of life, movie genres in the internet movie database. In recent visualization methods, such group information is conveyed by explicit regions that enclose related elements. However, ...
متن کاملConvex Polygon Intersection Graphs
Geometric intersection graphs are graphs determined by the intersections of certain geometric objects. We study the complexity of visualizing an arrangement of objects that induces a given intersection graph. We give a general framework for describing classes of geometric intersection graphs, using arbitrary finite base sets of rationally given convex polygons and rationally-constrained affine ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014